3008756 GI 91 Cover
نویسندگان
چکیده
The SAPHIRE project aims to develop an intelligent healthcare monitoring and decision support system on a platform integrating the wireless medical sensor data with hospital information systems. In the SAPHIRE project, patient monitoring will be achieved by using agent technology where the "agent behaviour" will be supported by intelligent clinical decision support systems which will be based on computerized clinical practice guidelines, and will access the patient medical history stored in medical information systems through semantically enriched Web services to tackle the interoperability problem. In this paper one of the two demonstrator environments – the homecare scenario – will be described from the medical and technical point of view.
منابع مشابه
Green Infrastructure Design for Stormwater Runoff and Water Quality: Empirical Evidence from Large Watershed-Scale Community Developments
Green infrastructure (GI) design is advocated as a new paradigm for stormwater management, whereas current knowledge of GI design is mostly based on isolated design strategies used at small-scale sites. This study presents empirical findings from two watershed-scale community projects (89.4 km and 55.7 km) in suburban Houston, Texas. The GI development integrates a suite of on-site, infiltratio...
متن کاملBounds for the Clique Cover Width of Factors of the Apex Graph of the Planar Grid
The clique cover width of G, denoted by ccw(G), is the minimum value of the bandwidth of all graphs that are obtained by contracting the cliques in a clique cover of G into a single vertex. For i = 1, 2, ..., d, let Gi be a graph with V (Gi) = V , and let G be a graph with V (G) = V and E(G) = ∩di=1(Gi), then we write G = ∩di=1Gi and call each Gi, i = 1, 2, ..., d a factor of G. The case where ...
متن کاملOn the Parallel Parameterized Complexity of the Graph Isomorphism Problem
In this paper, we study the parallel and the space complexity of the graph isomorphism problem (GI) for several parameterizations. Let H = {H1,H2, · · · ,Hl} be a finite set of graphs where |V (Hi)| ≤ d for all i and for some constant d. Let G be an H-free graph class i.e., none of the graphs G ∈ G contain any H ∈ H as an induced subgraph. We show that GI parameterized by vertex deletion distan...
متن کاملEndomorphism monoids of chained graphs
For any complete chain I whose distinct elements are separated by cover pairs, and for every family {Mi | i∈ I} of monoids, we construct a family of graphs {Gi | i∈ I} such that Gi is a proper induced subgraph of Gj for all i; j∈ I with i ¡ j, Gi = ⋂ {Gj | j∈ I; i ¡ j} whenever i = inf{ j∈ I | j¿ i} in I , Gi = ⋃ {Gj | j∈ I; j ¡ i} whenever i = sup{ j∈ I | j¡ i} in I , the endomorphism monoid o...
متن کاملNew Lung Cancer Panel for High-Throughput Targeted Resequencing
We present a new next-generation sequencing-based method to identify somatic mutations of lung cancer. It is a comprehensive mutation profiling protocol to detect somatic mutations in 30 genes found frequently in lung adenocarcinoma. The total length of the target regions is 107 kb, and a capture assay was designed to cover 99% of it. This method exhibited about 97% mean coverage at 30× sequenc...
متن کامل